Integrated process planning and scheduling using an imperialist competitive algorithm

نویسندگان

  • Kunlei Lian
  • Chaoyong Zhang
  • Xinyu Li
  • Liang Gao
چکیده

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae, and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand, or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of this material. Effective performance of modern manufacturing systems requires integrating process planning and scheduling more tightly, which is consistently challenged by the intrinsic interrelation and intractability of these two problems. Traditionally, these two problems are treated sequentially or separately. Integration of process planning and scheduling (IPPS) provides a valuable approach to improve system performance. However, IPPS is more complex than job shop scheduling or process planning. IPPS is strongly NP-hard in that, compared to an NP-hard job shop scheduling problem with a determined process plan, the process plan for each job in IPPS is also to be optimised. So, an imperialist competitive algorithm (ICA) is proposed to address the IPPS problem with an objective of makespan minimisation. An extended operation-based representation scheme is presented to include information on various flexibilities of process planning with respect to determined job shop scheduling. The main steps of the proposed ICA, including empires construction, assimilation, imperialistic competition, revolution and elimination, are elaborated using an illustrative example. Performance of the proposed ICA was evaluated on four sets of experiments taken from the literature. Computational results of the ICA were compared with that of some existing algorithms developed for IPPS, which validates the efficiency and effectiveness of the ICA in solving the IPPS problem. 1. Introduction Process planning and scheduling are two important functions in manufacturing systems. Both of them involve assignment of resources. Process planning links computer aided design and computer aided manufacturing by specifying resources needed to produce a part and determining detailed instructions for transforming raw materials into the final product. Scheduling is the act of assigning operations of all the jobs on available machines with precedence relationships among operations satisfied to optimise some predefined objectives. In traditional approaches, process planning and scheduling …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An imperialist competitive algorithm for solving the production scheduling problem in open pit mine

Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...

متن کامل

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

متن کامل

Efficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes

An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...

متن کامل

Optimization of Fabric Layout by Using Imperialist Competitive Algorithm

In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...

متن کامل

Trucks Scheduling to Reduce Delays in Multiple Cross-Docks Using Imperialist Competitive Algorithm

Cross docking is a logistics strategy that is now used by a large number of firms in the various industries. Cross docking effectively a significant reduction in transport costs, without increasing inventory and at the same time maintain the level of service to customers. It also can cross dock order to reduce cycle time, improve flexibility and responsiveness lead distribution network. In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012